Isometry-dual flags of AG codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Inheritance of the Isometry-Dual Property under Puncturing AG Codes

Consider a sequence of AG codes evaluating at a set of evaluation points P1, . . . , Pn the functions having only poles at a defining point Q, with the sequence of codes satisfying the isometry-dual condition (i.e. containing at the same time primal and their dual codes). We prove a necessary condition under which, after taking out a number of evaluation points (i.e. puncturing), the resulting ...

متن کامل

Flags of almost affine codes

We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues of relative generalized Hamming weights in the linear case.

متن کامل

Isometry groups of combinatorial codes

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the fu...

متن کامل

Isometry Groups of Additive Codes

When C ⊆ F is a linear code over a finite field F, every linear Hamming isometry of C to itself is the restriction of a linear Hamming isometry of F to itself, i.e., a monomial transformation. This is no longer the case for additive codes over non-prime fields. Every monomial transformation mapping C to itself is an additive Hamming isometry, but there exist additive Hamming isometries that are...

متن کامل

Isometry Classes of Indecomposable Linear Codes

In the constructive theory of linear codes, we can restrict attention to the isometry classes of indecomposable codes, as it was shown by Slepian. We describe these classes as orbits and we demonstrate how they can be enumerated using cycle index polynomials and the tools already incorporated in SYMMETRICA, a computer algebra package devoted to representation theory and combinatorics of symmetr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2020

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-020-00752-9